package mashibing.class12;

import leetcode.LeetCode333;
import leetcode.LeetCode333.TreeNode;

/**
 * 最大搜索二叉树子树数      leetCode-333 https://leetcode.com/problems/largest-bst-subtree
 *
 * @author yujiafan
 * @version 1.0.0
 * @create 2023-05-19
 */
public class Class12_5_MaxSubBSTSize {

    public static int maxSubBSTSize(TreeNode head) {
        return LeetCode333.largestBSTSubtree(head);
    }
}
